Two algorithms for computing the matrix cosine function

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Algorithms for Computing the Matrix Sine and Cosine Separately or Simultaneously

Several existing algorithms for computing the matrix cosine employ polynomial or rational approximations combined with scaling and use of a double angle formula. Their derivations are based on forward error bounds. We derive new algorithms for computing the matrix cosine, the matrix sine, and both simultaneously, that are backward stable in exact arithmetic and behave in a forward stable manner...

متن کامل

Algorithms for the Matrix Sector Function

In this paper we consider algorithms for the matrix sector function, which is a generalization of the matrix sign function. We develop algorithms for computing the matrix sector function based on the (real) Schur decompositions, with and without reordering and the Parlett recurrence. We prove some results on the convergence regions for the specialized versions of Newton’s and Halley’s methods a...

متن کامل

Computing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method

A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...

متن کامل

Computing a Matrix Function for Exponential Integrators

An efficient numerical method is developed for evaluating φ(A), where A is a symmetric matrix and φ is the function defined by φ(x) = (ex − 1)/x = 1+ x/2 + x2/6+ .... This matrix function is useful in the so-called exponential integrators for differential equations. In particular, it is related to the exact solution of the ODE system dy/dt = Ay + b, where A and b are t-independent. Our method a...

متن کامل

Efficient Data Mining with Evolutionary Algorithms for Cloud Computing Application

With the rapid development of the internet, the amount of information and data which are produced, are extremely massive. Hence, client will be confused with huge amount of data, and it is difficult to understand which ones are useful. Data mining can overcome this problem. While data mining is using on cloud computing, it is reducing time of processing, energy usage and costs. As the speed of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics and Computation

سال: 2017

ISSN: 0096-3003

DOI: 10.1016/j.amc.2017.05.019